energy of binary labeled graphs

نویسندگان

pradeep g. bhat

sabitha d'souza

چکیده

‎let $g$ be a graph with vertex set $v(g)$ and edge set $x(g)$ and consider the set $a={0,1}$‎. ‎a mapping $l:v(g)longrightarrow a$ is called binary vertex labeling of $g$ and $l(v)$ is called the label of the vertex $v$ under $l$‎. ‎in this paper we introduce a new kind of graph energy for the binary labeled graph‎, ‎the labeled graph energy $e_{l}(g)$‎. ‎it depends on the underlying graph $g$ and on its binary labeling‎, ‎upper and lower bounds for $e_{l}(g)$ are established‎. ‎the labeled energies of a number of well known and much studied families of graphs are computed‎.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Labeled Binary Planar Trees

We study the natural map η between a group of binary planar trees whose leaves are labeled by elements of a free abelian group H and a certain group D(H) derived from the free Lie algebra over H. Both of these groups arise in several different topological contexts. η is known to be an isomorphism over Q, but not over Z. We determine its cokernel and attack the conjecture that it is injective.

متن کامل

Labeled packings of graphs

Graph packing generally considers unlabeled graphs. In this paper, we introduce a new variant of the graph packing problem, called the labeled packing of graphs. In particular, we present some results and conjectures about cycles.

متن کامل

cient Retrieval of Labeled Binary

Generalizations of the classical ngram indexing technique provide a powerful tool for the fast retrieval of tree structures. We investigate the special case of binary trees, which are heavily used, e. g., in computer linguistics: Given a database T = ft1; : : : ; tng of labeled binary trees and a query tree q, nd eeciently all trees t 2 T that contain q as subtree. For supporting queries of thi...

متن کامل

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

On net-Laplacian Energy of Signed Graphs

A signed graph is a graph where the edges are assigned either positive ornegative signs. Net degree of a signed graph is the dierence between the number ofpositive and negative edges incident with a vertex. It is said to be net-regular if all itsvertices have the same net-degree. Laplacian energy of a signed graph is defined asε(L(Σ)) =|γ_1-(2m)/n|+...+|γ_n-(2m)/n| where γ_1,...,γ_n are the ei...

متن کامل

Average Degree-Eccentricity Energy of Graphs

The concept of average degree-eccentricity matrix ADE(G) of a connected graph $G$ is introduced. Some coefficients of the characteristic polynomial of ADE(G) are obtained, as well as a bound for the eigenvalues of ADE(G). We also introduce the average degree-eccentricity graph energy and establish bounds for it.

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
transactions on combinatorics

ناشر: university of isfahan

ISSN 2251-8657

دوره 2

شماره 3 2013

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023